Early Experiences in Traffic Engineering Exploiting Path Diversity: A Practical Approach

Recent literature has proved that stable dynamic routing algorithms have solid theoretical foundation that makes them suitable to be implemented in a real protocol, and used in practice in many different operational network contexts. Such algorithms inherit much of the properties of congestion controllers implementing one of the possible combination of AQM/ECN schemes at nodes and flow control at sources. In this paper we propose a linear program formulation of the multi-commodity flow problem with congestion control, under max-min fairness, comprising demands with or without exogenous peak rates. Our evaluations of the gain, using path diversity, in scenarios as intra-domain traffic engineering and wireless mesh networks encourages real implementations, especially in presence of hot spots demands and non uniform traffic matrices. We propose a flow aware perspective of the subject by using a natural multi-path extension to current congestion controllers and show its performance with respect to current proposals. Since flow aware architectures exploiting path diversity are feasible, scalable, robust and nearly optimal in presence of flows with exogenous peak rates, we claim that our solution rethinked in the context of realistic traffic assumptions performs as better as an optimal approach with all the additional benefits of the flow aware paradigm

STRATEGIES FOR LOOP PREVENTION FORWARDING LOGIC IN HYBRID INFORMATION CENTRIC NETWORKING

Techniques are described herein that provide a forwarding strategy applicable to Information Centric Networking (ICN) networks and hybrid ICN (hICN) networks. In such networks, Interest requests are likely to be hair-pinned back to a Forwarder that is serving a dynamic cache system. When the dynamic cache system has no representation of the named data object, the Forwarder must recycle the Interest request back into the network. However, the Forwarding logic must avoid hair-pinning the Interest back to the same unpopulated cache

FAST EDGE ACCESS CONTROL FOR ROUTED TRAFFIC

Real-Time Communication (RTC) traffic typically leverages one or more media bridges (often located in the cloud) and, in order to reduce latency and/or offload cloud resources to the edge, one or more real-time edge relays can be utilized in order to optimize such traffic. Presented herein are techniques to secure a media edge relay node without requiring an authentication for a connection involving the media edge relay node

FAST NETWORK ADDRESS TRANSLATION TRAVERSAL FOR CONNECTION MIGRATION

Conventional mechanisms for traversing a network address translation (NAT) device can be slow and, as such, may limit dynamic traffic management of traffic flows through network edge devices. Presented herein are techniques that provide a mechanism to support connection migration (e.g., from the cloud to the edge) with fast NAT traversal

TECHNIQUES TO PROVIDE EDGE RELAYS WITH PRIVACY-PRESERVING CACHES

Real-Time Communication (RTC) traffic typically leverages one or more media bridges (often located in the cloud) and, in order to reduce latency and/or offload cloud resources to the edge, one or more real-time edge relays can be utilized in order to optimize such traffic. However, edge relays may also be exploited by malicious entities and, thus, certain protective mechanisms are typically utilized at edge relays that, while reducing the probability of being exploited, can reduce the throughput of such edge relays. Techniques presented herein may help to preserve data privacy at edge relays through the use of a time-local caching mechanism

RELIABLE INTERESTS IN INFORMATION-CENTRIC NETWORKING

In an information-centric networking (ICN) environment, an interest may be dropped by a network for any number of reasons. However, if an interest is lost then the corresponding data cannot be received, thereby reducing the performance of a network. Techniques are presented herein that make ICN interests more resilient to potential losses by adding certain state information into an interest payload. That state information may be used to keep track of the previous interests that have been sent by a forwarder face for a specific name. To encode the sequence numbers of the interests that have been previously sent, a first aspect of the presented techniques employs a list of sequence numbers while a second aspect of the presented techniques employs a bitmap. The presented techniques may be used to reduce the possibility that interests are not dropped during transit when using ICN